A Simple Introduction to Gröbner Basis Methods in String Phenomenology
نویسندگان
چکیده
منابع مشابه
A Simple Introduction to Gröbner Basis Methods in String Phenomenology
In this talk I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then give 3 examples of its use in physics. I describe how it can be used to obtain constraints on flux parameters, how it can simplify the equations describing va...
متن کاملGröbner Basis Methods for Minimal Problems in Computer Vision
Preface Working with problems concerning relative pose for autonomous vehicles has given me the inspiration and motive to consider the task of solving multivariate polynomial equations. In this thesis a strategy for solving multivariate polynomial equations using the elegant framework of algebraic geometry and the powerful tools from numerical linear algebra is presented. This strategy has perm...
متن کاملString Phenomenology ∗
These lectures present some topics of string phenomenology and contain two parts. In the first part, I review the possibility of lowering the string scale in the TeV region, that provides a theoretical framework for solving the mass hierarchy problem and unifying all interactions. The apparent weakness of gravity can then be accounted by the existence of large internal dimensions, in the sub-mi...
متن کاملTopics in String Phenomenology
We consider two questions in string “phenomenology.” First, are there any generic string predictions? Second, are there any general lessons which string theory suggests for thinking about low energy models, particularly in the framework of supersymmetry? Among the topics we consider are the squark and slepton spectrum, flavor symmetries, discrete symmetries including CP , and Peccei-Quinn symme...
متن کاملBlock Ciphers Sensitive to Gröbner Basis Attacks
We construct and analyze Feistel and SPN ciphers that have a sound design strategy against linear and differential attacks but for which the encryption process can be described by very simple polynomial equations. For a block and key size of 128 bits, we present ciphers for which practical Gröbner basis attacks can recover the full cipher key requiring only a minimal number of plaintext/ciphert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in High Energy Physics
سال: 2011
ISSN: 1687-7357,1687-7365
DOI: 10.1155/2011/217035